Comments on: Dynamic relations for sparsely sampled Gaussian processes
نویسندگان
چکیده
منابع مشابه
Dynamic Relations for Sparsely Sampled Gaussian Processes
In longitudinal studies, it is common to observe repeated measurements data from a sample of subjects where noisy measurements are made at irregular times, with a random number of measurements per subject. Often a reasonable assumption is that the data are generated by the trajectories of a smooth underlying stochastic process. In some cases one observes multivariate time courses generated by a...
متن کاملMaximum-likelihood Identification of Sampled Gaussian Processes
This work considers sampled data of continuous-domain Gaussian processes. We derive a maximum-likelihood estimator for identifying autoregressive moving average parameters while incorporating the sampling process into the problem formulation. The proposed identification approach introduces exponential models for both the continuous and the sampled processes. We construct a likelihood function f...
متن کاملClustering for sparsely sampled functional data
We develop a flexible model-based procedure for clustering functional data. The technique can be applied to all types of curve data but is particularly useful when individuals are observed at a sparse set of time points. In addition to producing final cluster assignments, the procedure generates predictions and confidence intervals for missing portions of curves. Our approach also provides many...
متن کاملIndex Models for Sparsely Sampled Functional Data
The regression problem involving functional predictors has many important applications and a number of functional regression methods have been developed. However, a common complication in functional data analysis is one of sparsely observed curves, that is predictors that are observed, with error, on a small subset of the possible time points. Such sparsely observed data induces an errors-in-va...
متن کاملRelational Gaussian Processes for Learning Preference Relations
Preference learning has received increasing attention in both machine learning and information retrieval. The goal of preference learning is to automatically learn a model to rank entities (e.g., documents, webpages, products, music, etc.) according to their degrees of relevance. The particularity of preference learning might be that the training data is a set of pairwise preferences between en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TEST
سال: 2009
ISSN: 1133-0686,1863-8260
DOI: 10.1007/s11749-009-0178-2